Complex Division with Prescaling of Operands
نویسنده
چکیده
We adapt the radix-r digit-recurrence division algorithm to complex division. By prescaling the operands, we make the selection of quotient digits simple. This leads to a simple hardware implementation, and allows correct rounding of complex quotient. To reduce large prescaling tables required for radices greater than 4, we adapt the bipartite-table method to multiple-operand functions.
منابع مشابه
Fast low-power shared division and square-root architecture
This paper addresses a fast low-power implementation of a shared division and square-root architecture. Two approaches are considered in this paper; these include the SRT (Sweeney, Robertson and Tocher) approach which does not require prescaling and the GST (generalized Svoboda and Tung) approach which requires prescaling of the operands. This paper makes two important contributions. Although S...
متن کاملPower Comparison of Srt and Gst Dividers
Generally divider algorithms can be separated into two diierent kinds of algorithms, the Multiplicative Algorithms (MA) and the Iterative Digit Recurrence Algorithms (IDRA). The number of iterations of the MA and IDRA are proportional to log 2 (word?length) and the word-length, respectively. However every iteration of the MA consists of two multiplications and one addition, while the iteration ...
متن کاملBoosting Very-High Radix Division with Prescaling and Selection by Rounding
An extension of the very-high radix division with prescaling and selection by rounding is presented. This extension consists in increasing the effective radix of the implementation by obtaining a few additional bits of the quotient per iteration, without increasing the complexity of the unit to obtain the prescaling factor nor the delay of an iteration. As a consequence, for some values of the ...
متن کاملDivision with Speculation of the Quotient Digits
Progress in VLSI technology has made possible the hardware implementation of all the basic arithmetic operations in the design of general-purpose as well as special-purpose processors. While operations such as multiplication and sum have been extensively studied and fast implementations are possible, the design of fast and eecient circuits for division is still challenging. The factor that limi...
متن کاملA New Iterative Structure for Hardware Division: The Parallel Paths Algorithm
This paper presents a new approach to hardware division—the parallel paths algorithm. In this approach, prescaling allows the division recurrence to be implemented by three processes which can be calculated in parallel during iterations. While two of the processes must complete in a single iteration, the third—which includes the most expensive division operations—can be calculated over multiple...
متن کامل